Rivulet: 3D Neuron Morphology Tracing with Iterative Back-Tracking

The digital reconstruction of single neurons from 3D confocal microscopic images is an important tool for understanding the neuron morphology and function. However the accurate automatic neuron reconstruction remains a challenging task due to the varying image quality and the complexity in the neuronal arborisation. Targeting the common challenges of neuron tracing, we propose a novel automatic 3D neuron reconstruction algorithm, named Rivulet, which is based on the multi-stencils fast-marching and iterative backtracking. The proposed Rivulet algorithm is capable of tracing discontinuous areas without being interrupted by densely distributed noises. By evaluating the proposed pipeline with the data provided by the Diadem challenge and the recent BigNeuron project, Rivulet is shown to be robust to challenging microscopic imagestacks. We discussed the algorithm design in technical details regarding the relationships between the proposed algorithm and the other state-of-the-art neuron tracing algorithms

Reconstruction of 3D neuron morphology using Rivulet back-tracking

The 3D reconstruction of neuronal morphology is a powerful technique for investigating nervous systems. Due to the noises in optical microscopic images, the automated reconstruction of neuronal morphology has been a challenging problem. We propose a novel automatic neuron reconstruction algorithm, Rivulet, to target the challenges raised by the poor quality of the optical microscopic images. After the neuron images being de-noised with an anisotropic filter, the Rivulet algorithm combines multi-stencils fast-marching and iterative back-tracking from the geodesic farthest point on the segmented foreground. The neuron segments are dumped or merged according to a set of criteria at the end of each iteration. The proposed Rivulet tracing algorithm is evaluated with data provided from the BigNeuron Project. The experimental results demonstrate that Rivulet outperforms the compared state-of-the-art tracing methods when the images are of poor quality

Subject-centered multi-view feature fusion for neuroimaging retrieval and classification

Multi-View neuroimaging retrieval and classification play an important role in computer-aided-diagnosis of brain disorders, as multi-view features could provide more insights of the disease pathology and potentially lead to more accurate diagnosis than single-view features. The large inter-feature and inter-subject variations make the multi-view neuroimaging analysis a challenging task. Many multi-view or multi-modal feature fusion methods have been proposed to reduce the impact of inter-feature variations in neuroimaging data. However, there is not much in-depth work focusing on the inter-subject variations. In this study, we propose a subject-centered multi-view feature fusion method for neuroimaging retrieval and classification based on the propagation graph fusion (PGF) algorithm. Two main advantages of the proposed method are: 1) it evaluates the query online and adaptively reshapes the connections between subjects according to the query; 2) it measures the affinity of the query to the subjects using the subject-centered affinity matrices, which can be easily combined and efficiently solved. Evaluated using a public accessible neuroimaging database, our algorithm outperforms the state-of-the-art methods in retrieval and achieves comparable performance in classification

Longitudinal brain MR retrieval with diffeomorphic demons registration: What happened to those patients with similar changes?

Current medical content-based retrieval (MCBR) systems for neuroimaging data mainly focus on retrieving the cross-sectional neuroimaging data with similar regional or global measurements. The longitudinal pathological changes along different time-points are usually neglected in such MCBR systems. We propose the cross-registration based retrieval for longitudinal MR data to retrieve patients with similar structural changes as an extension to the existing MCBR systems. The diffeomorphic demons registration is used to extract the tissue deformation between two adjacent MR volumes. An asymmetric square dissimilarity matrix is designed for indexing the patient changes within a specific interval. A visual demonstration is given to show the registration displacement fields of the query as compared to the simulated results. The experimental performance with the mean average precision (mAP) and the average top-K accuracy (aACC) are reported for evaluation

Clique Identification and Propagation for Multimodal Brain Tumor Image Segmentation

Brain tumors vary considerably in size, morphology, and location across patients, thus pose great challenge in automated brain tumor segmentation methods. Inspired by the concept of clique in graph theory, we present a clique-based method for multimodal brain tumor segmentation that considers a brain tumor image as a graph and automatically segment it into different sub-structures based on the clique homogeneity. Our proposed method has three steps, neighborhood construction, clique identification, and clique propagation. We constructed the neighborhood of each pixel based on its similarities to the surrounding pixels, and then extracted all cliques with a certain size k to evaluate the correlations among different pixels. The connections among all cliques were represented as a transition matrix, and a clique propagation method was developed to group the cliques into different regions. This method is also designed to accommodate multimodal features, as multimodal neuroimaging data is widely used in mapping the tumor-induced changes in the brain. To evaluate this method, we conduct the segmentation experiments on the publicly available Multimodal Brain Tumor Image Segmentation Benchmark (BRATS) dataset. The qualitative and quantitative results demonstrate that our proposed clique-based method achieved better performance compared to the conventional pixel-based methods